Counting Faces of Randomly-projected Polytopes When the Projection Radically Lowers Dimension
نویسنده
چکیده
1.1. Three surprises of high dimensions. This paper develops asymptotic methods to count faces of random high-dimensional polytopes; a seemingly dry and unpromising pursuit. Yet our conclusions have surprising implications in statistics, probability, information theory, and signal processing with potential impacts in practical subjects like medical imaging and digital communications. Before involving the reader in our lengthy analysis of high-dimensional face counting, we describe three implications of our results.
منابع مشابه
Construction and Analysis of Projected Deformed Products
We introduce a deformed product construction for simple polytopes in terms of lowertriangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products such that specified faces (e.g. all the k-faces) are “strictly preserved” under projection. Thus, starting from an arbitrary neighborly simplicial (d−2)-polytope...
متن کامل19 Polytope Skeletons and Paths
The k-dimensional skeleton of a d-polytope P is the set of all faces of the polytope of dimension at most k. The 1-skeleton of P is called the graph of P and denoted by G(P ). G(P ) can be regarded as an abstract graph whose vertices are the vertices of P , with two vertices adjacent if they form the endpoints of an edge of P . In this chapter, we will describe results and problems concerning g...
متن کاملFrom Polytopes to Enumeration
In the problem session you saw that v-e+f=2 for 3-polytopes. Is something similar true in higher dimensions? Are there other restrictions on the number of faces of each dimension? What is the most number of faces in each dimension if we fix the number of vertices and dimension? The least? What if we fix other numbers of faces in random dimensions? Notice that all of these questions involve coun...
متن کاملEquality Set Projection: A new algorithm for the projection of polytopes in halfspace representation
In this paper we introduce a new algorithm called Equality Set Projection (ESP) for computing the orthogonal projection of bounded, convex polytopes. Our solution addresses the case where the input polytope is represented as the intersection of a finite number of halfplanes and its projection is given in an irredundant halfspace form. Unlike many existing approaches, the key advantage offered b...
متن کاملHigh-Dimensional Centrally Symmetric Polytopes with Neighborliness Proportional to Dimension
Let A be a d by n matrix, d < n. Let C be the regular cross polytope (octahedron) in R. It has recently been shown that properties of the centrosymmetric polytope P = AC are of interest for finding sparse solutions to the underdetermined system of equations y = Ax; [9]. In particular, it is valuable to know that P is centrally k-neighborly. We study the face numbers of randomly-projected cross-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006